t = int(input())
for _ in range(0,t):
n = int(input())
list1 = [int(num) for num in input().split()]
set1 = set(list1)
if(len(set1)>=2):
print(1)
else:
print(len(list1))#include <bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin>>t;
while(t--){
int n;
cin>>n;
int a[n];
int counter=0;
for (int i = 0; i < n; ++i)
{
cin>>a[i];
}
for (int i = 0; i < n-1; ++i)
{
if(a[i]==a[i+1]){
counter++;
}
}
if (counter==n-1)
{
cout<<n<<endl;
}else{
cout<<"1"<<endl;
}
}
return 0;
}1399A - Remove Smallest | 208A - Dubstep |
1581A - CQXYM Count Permutations | 337A - Puzzles |
495A - Digital Counter | 796A - Buying A House |
67A - Partial Teacher | 116A - Tram |
1472B - Fair Division | 1281C - Cut and Paste |
141A - Amusing Joke | 112A - Petya and Strings |
677A - Vanya and Fence | 1621A - Stable Arrangement of Rooks |
472A - Design Tutorial Learn from Math | 1368A - C+= |
450A - Jzzhu and Children | 546A - Soldier and Bananas |
32B - Borze | 1651B - Prove Him Wrong |
381A - Sereja and Dima | 41A - Translation |
1559A - Mocha and Math | 832A - Sasha and Sticks |
292B - Network Topology | 1339A - Filling Diamonds |
910A - The Way to Home | 617A - Elephant |
48A - Rock-paper-scissors | 294A - Shaass and Oskols |